Utilization-Based Admission Control for Real-Time Applications

نویسندگان

  • Dong Xuan
  • Chengzhi Li
  • Riccardo Bettati
  • Jianer Chen
  • Wei Zhao
چکیده

In this paper, we present a methodology to use utilization-based admission control in guaranteed real-time communication in a scalable fashion. We make admission control scalable by using a configuration-time test to determine a safe utilization level of servers. Admission control at run-time then is reduced to simple utilization tests on the servers along the path of the new flow. Furthermore, we discuss how appropriate route selection improve utilization levels, design a safe route selection heuristic algorithm to achieve high utilization of resources, and derive two bounds on the maximum utilization level for given traffic in a network. We compare the results of our route selection heuristics with that of a shortest-path based algorithm, and find that our heuristics can achieve a much higher maximum utilization level than that of the shortest-path based algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Call Admission Control Scheme based on Quality of Service (QoS)

The quality of service (QoS) of several real time multimedia applications has become a crucial research topic. One of the challenges to achieve QoS requirements is to determine how to allocate system bandwidth to various applications with the respect of their QoS requirements. In this paper, we proposed a Call Admission Control scheme based on QoS requirements of different traffic types in mobi...

متن کامل

Comments on the Performance of Measurement-Based Admission Control Algorithms

Relaxed real-time services that do not provide guaranteed loss rates or delay bounds are of considerable interest in the Internet, since these services can achieve higher utilization than hard real-time services while still providing adequate service to adaptive real-time applications. Achieving this higher level of utilization depends on an admission control algorithm that does not rely on wor...

متن کامل

An Efficient On-line Job Admission Control Scheme to Guarantee Deadlines for QoS-Demanding Applications

Guaranteeing deadlines is essential in providing high levels of QoS (Quality of Service) in many networked applications that require timely processing and delivery of requested data. However, despite recent developments in real-time computing, current real-time scheduling theory cannot be directly applied to those applications since most real-time research has focused on the periodic task model...

متن کامل

Admission and Traffic Control Schemes Suitable for QoS Applications in WLAN Systems

This paper proposes the use of admission and traffic control schemes for real-time applications. The admission control scheme determines the admission of high-priority real-time applications such as voice and video streams in terms of their bandwidth utilization time (medium time), whereas the traffic control scheme maintains the communication quality of applications permitted admission by rest...

متن کامل

Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks

Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource requirements. We propose two new admission control approaches to address this problem. First, we present an efficient schedulability test, called utilization demand analysis, to handle periodic and aperiodic tasks with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000